A Representation Approach to the Tower of Hanoi Problem
نویسنده
چکیده
By making the moving direction of each disc explicit in the representation, a bit-string so constructed can be used to drive the Tower of Hanoi algorithm. The behaviour of disc moves is further analyzed based on the bit-string representation. It has been shown that the bit-string for moving n discs can be used to generate successively the Gray codes of n bits.
منابع مشابه
Graphs S ( n , k ) and a variant of the Tower of Hanoi problem ∗
For any n ≥ 1 and any k ≥ 1, a graph S(n, k) is introduced. Vertices of S(n, k) are n-tuples over {1, 2, . . . , k} and two n-tuples are adjacent if they are in a certain relation. These graphs are graphs of a particular variant of the Tower of Hanoi problem. Namely, the graphs S(n, 3) are isomorphic to the graphs of the Tower of Hanoi problem. It is proved that there are at most two shortest p...
متن کاملHop eld Networks for Solving Tower of Hanoi Problem
In this paper, Hop eld neural networks have been considered in solving tower of Hanoi test which is used in determining of de cit of planning capability of human prefrontal cortex. The main di erence of this work from the ones in the literature which use neural networks, is: The tower of Hanoi problem has been formulated here as a special shortest path problem. In the literature, some Hop eld n...
متن کاملHamiltonianicity of the Towers of Hanoi Problem
In this paper we analyze a variant of the n-disk Towers of Hanoi problem with an arbitrary starting and ending configuration using transition graphs representing valid configurations. In particular, we show that starting with any configuration, there is a sequence of moves that goes through each valid configuration exactly once and back to the starting configuration. Also, we show how the origi...
متن کاملAbstracting the Tower of Hanoi
ing the Tower of Hanoi Craig A. Knoblock School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 [email protected] Abstract This paper describes an automated approach to generating abstractions for the Tower of Hanoi and analyzes the use of these abstractions for problem solving. The analysis shows that the learned abstractions produce an exponential reduction in the size of the...
متن کاملExplorations in 4-peg Tower of Hanoi
Finding an optimal solution to the 4-peg version of the classic Tower of Hanoi problem has been an open problem since the 19th century, despite the existence of a presumed-optimal solution. We verify that the presumed-optimal Frame-Stewart algorithm for 4-peg Tower of Hanoi is indeed optimal, for up to 20 discs. We also develop a distributed Tower of Hanoi algorithm, and present 2D and 3D repre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. J.
دوره 25 شماره
صفحات -
تاریخ انتشار 1982